An efficient algorithm for establishing trust In strangers

نویسندگان

  • Igal Golan
  • Amir Herzberg
چکیده

The Internet enables connectivity between many entities that don't know each other, but to enable e-business between them, the parties need to establish some level of trust in each other. The trust can be established through the presentation of 3 party credentials where a credential is a statement made by an issuer about a subject. We describe a Trust Policy Language (TPL) which allows a party to assign different trust levels to potential partners based on credentials they present and based on the level of trust assigned to their credentials’ issuers, to their issuers’ issuers and so on. We then describe an efficient incremental algorithm for an e-commerce application that uses such Trust policies. The algorithm is designed to assign trust levels to millions of users each having several credentials and to cope with a dynamic environment in which new credentials are introduced and existing credentials may expire or be revoked. We first present an algorithm for a monotonic policy where new credentials can only result in new trust level assignments. We then extend the language and we get a non monotonic policy where new credentials can result in invalidating some of the previously trust assignments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Technology of Trust Credential Chain Discovery

Increased connectivity and data availability enable new ways of conducting business, but they also create new security vulnerabilities. For example, to streamline a financial transaction, an organization might want to give certain strangers — that is, parties from outside its security domain — access to some of its local resources. Before doing so, however, the organization must establish firm ...

متن کامل

A Trust Region Algorithm for Solving Nonlinear Equations (RESEARCH NOTE)

This paper presents a practical and efficient method to solve large-scale nonlinear equations. The global convergence of this new trust region algorithm is verified. The algorithm is then used to solve the nonlinear equations arising in an Expanded Lagrangian Function (ELF). Numerical results for the implementation of some large-scale problems indicate that the algorithm is efficient for these ...

متن کامل

Requirements for Policy Languages for Trust Negotiation

In open systems like the Internet, traditional approaches to security based on identity do not provide a solution to the problem of establishing trust between strangers, because strangers do not share the same security domain. A new approach to establishing trust between strangers is trust negotiation, the bilateral exchange of digital credentials describing attributes of the negotiation partic...

متن کامل

A TRUST-REGION SEQUENTIAL QUADRATIC PROGRAMMING WITH NEW SIMPLE FILTER AS AN EFFICIENT AND ROBUST FIRST-ORDER RELIABILITY METHOD

The real-world applications addressing the nonlinear functions of multiple variables could be implicitly assessed through structural reliability analysis. This study establishes an efficient algorithm for resolving highly nonlinear structural reliability problems. To this end, first a numerical nonlinear optimization algorithm with a new simple filter is defined to locate and estimate the most ...

متن کامل

An Introduction to Automated Trust Establishment

1 The last decade of improvement in service offerings over the Internet offers the hope that many kinds of sensitive interactions between strangers can be carried out electronically, without requiring physical transmission of paper credentials to establish trust. In this short paper, I describe one way of converting the current paper-based approach to establishing trust into an electronic appro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001